a simulated annealing algorithm for unsplittable capacitated network design
Authors
abstract
the network design problem (ndp) is one of the important problems in combinatorial optimization. among the network design problems, the multicommodity capacitated network design (mcnd) problem has numerous applications in transportation, logistics, telecommunication, and production systems. the mcnd problems with splittable flow variables are np-hard, which means they require exponential time to be solved in optimality. with binary flow variables or unsplittable mcnd, the complexity of the problem is increased significantly. with growing complexity and scale of real world capacitated network design applications, metaheuristics must be developed to solve these problems. this paper presents a simulated annealing approach with innovative representation and neighborhood structure for unsplittable mcnd problem. the parameters of the proposed algorithms are tuned using design of experiments (doe) method and the design-expert statistical software. the performance of the proposed algorithm is evaluated by solving instances with different dimensions from or-library. the results of the proposed algorithm are compared with the solutions of cplex solver. the results show that the proposed sa can find near optimal solution in much less time than exact algorithm.
similar resources
A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
full textA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
full textA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
full textA Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design
The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs. Several strategies for open...
full textCapacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra
We consider the Capacitated Multi-Layer Network Design with Unsplittable demands (CMLND-U) problem. Given a two-layer network and a set of traffic demands, this problem consists in installing minimum cost capacities on the upper layer so that each demand is routed along a unique ”virtual” path (even using a unique capacity on each link) in this layer, and each installed capacity is in turn asso...
full textCapacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
full textMy Resources
Save resource for easier access later
Journal title:
international journal of industrial engineering and productional research-جلد ۲۳، شماره ۲، صفحات ۹۱-۱۰۰
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023